Controlling Extraction in Abstract Categorial Grammars

نویسندگان

  • Sylvain Pogodalla
  • Florent Pompigne
چکیده

This paper proposes an approach to control extraction in the framework of Abstract Categorial Grammar (ACG). As examples, we consider embedded wh-extraction, multiple wh-extraction and tensed-clauses as scope islands. The approach relies on an extended type system for ACG that introduces dependent types and advocates for a treatment at a rather abstract (tectogrammatical) level. Then we discuss approaches that put control at the object (phenogrammatical) level, using appropriate calculi.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Treating ellipsis : two abstract categorial grammar perspectives (Traitements d'ellipses : deux approches par les grammaires catégorielles abstraites) [in French]

Treating ellipsis : two abstract categorial grammar perspectives The treatment of ellipsis in models of the syntax-semantics interface is troublesome as the linguistic material removed in the phonologic interpretation is still necessary in the semantics. Examples are particular cases of coordination, especially the ones involving verbal phrase ellipsis or subject elision. We show a way to use a...

متن کامل

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order ...

متن کامل

Abstract Categorial Parsing as Linear Logic Programming

This paper shows how the parsing problem for general Abstract Categorial Grammars can be reduced to the provability problem for Multiplicative Exponential Linear Logic. It follows essentially a similar reduction by Kanazawa, who has shown how the parsing problem for second-order Abstract Categorial Grammars reduces to datalog queries.

متن کامل

On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

We show how to encode context-free string grammars, linear contextfree tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a sec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010